A generalized BPX multigrid framework covering nonnested V-cycle methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Bpx Multigrid Framework Covering Nonnested V-cycle Methods

More than a decade ago, Bramble, Pasciak and Xu developed a framework in analyzing the multigrid methods with nonnested spaces or noninherited quadratic forms. It was subsequently known as the BPX multigrid framework, which was widely used in the analysis of multigrid and domain decomposition methods. However, the framework has an apparent limit in the analysis of nonnested V-cycle methods, and...

متن کامل

Errata to "A generalized BPX multigrid framework covering nonnested V-cycle methods"

More than a decade ago, Bramble, Pasciak and Xu developed a framework in analyzing the multigrid methods with nonnested spaces or noninherited quadratic forms. It was subsequently known as the BPX multigrid framework, which was widely used in the analysis of multigrid and domain decomposition methods. However, the framework has an apparent limit in the analysis of nonnested V-cycle methods, and...

متن کامل

Higher-dimensional Nonnested Multigrid Methods

Nonnested multigrid methods are shown to be optimal-order solvers for systems of finite element equations arising from elliptic boundary problems in any space dimension. Results are derived for Lagrange-type elements of arbitrary degree.

متن کامل

Analysis of V - Cycle Multigrid

We describe and analyze certain V-cycle multigrid algorithms with forms deened by numerical quadrature applied to the approximation of symmetric second order elliptic boundary value problems. This approach can be used for the eecient solution of nite element systems resulting from numerical quadrature as well as systems arising from nite diierence discretizations. The results are based on a reg...

متن کامل

Algebraic analysis of V–cycle multigrid

We consider multigrid methods for symmetric positive definite linear systems. We develop an algebraic analysis of V–cycle schemes with Galerkin coarse grid matrices. This analysis is based on the Successive Subspace Correction convergence theory which we revisit. We reformulate it in a purely algebraic way, and extend its scope of application to, e.g., algebraic multigrid methods. This reformul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2007

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-06-01897-7